Feat: FetchGraphToDepth() to fetch a graph to a given depth#5134
Closed
Feat: FetchGraphToDepth() to fetch a graph to a given depth#5134
Conversation
d9be5a0 to
6dc6748
Compare
This comes in the context of #5133. It enables Merkledag to fetch DAGs down to a given depth. Note that actual usage of depth is expected to be 1, or 2 (and not an arbitrarily high value), thus I have opted to not complicate things with branch-pruning optimizations. They can be introduced if they are ever needed at another point in time. License: MIT Signed-off-by: Hector Sanjuan <code@hector.link>
6dc6748 to
8e34775
Compare
Contributor
Author
|
Superseeded by #5142 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This comes in the context of #5133. It enables Merkledag to fetch
DAGs down to a given depth.
Note that actual usage of depth is expected to be 1, or 2 (and not
an arbitrarily high value),
thus I have opted to not complicate things withactually there is branch pruning in the new PR.branch-pruning optimizations. They can be introduced if they are ever needed
at another point in time.